Computing and extracting minimal cograph completions in linear time ∗
نویسندگان
چکیده
A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we characterize minimal cograph completions, and we give the following linear-time algorithms: one for extracting a minimal cograph completion from any given cograph completion of G, and one for directly computing a minimal cograph completion of G with a vertex incremental approach.
منابع مشابه
Reports in Informatics Characterizing and Computing Minimal Cograph Completions Characterizing and Computing Minimal Cograph Completions *
A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The first is a a characterization that allows us to check in linear time whether a given cograph completion is minimal. The second result is ...
متن کاملCharacterizing and Computing Minimal Cograph Completions
A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The first is a a characterization that allows us to check in linear time whether a given cograph completion is minimal. The second result is ...
متن کاملSingle-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions
We study graph properties that admit an increasing, or equivalently decreasing, sequence of graphs on the same vertex set such that for any two consecutive graphs in the sequence their difference is a single edge. This is useful for characterizing and computing minimal completions and deletions of arbitrary graphs into having these properties. We prove that threshold graphs and chain graphs adm...
متن کاملMinimal split completions
We study the problem of adding an inclusion minimal set of edges to a given arbitrary graph so that the resulting graph is a split graph, called a minimal split completion of the input graph. Minimal completions of arbitrary graphs into chordal and interval graphs have been studied previously, and new results have been added recently. We extend these previous results to split graphs by giving a...
متن کاملMinimal separators in P4-sparse graphs
In this paper, we determine the minimal separators of P4-sparse graphs and establish bounds on their number. Specifically, we show that a P4-sparse graph G on n vertices and m edges has fewer than 2n/3 minimal separators of total description size at most 4m/3. The bound on the number of minimal separators is tight and is also tight for the class of cographs, a well known subclass of the P4-spar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007